Property-Oriented Testing based on Simulated Annealing

نویسندگان

  • Olfa Abdellatif-Kaddour
  • Pascale Thévenod-Fosse
  • Hélène Waeselynck
چکیده

Property-oriented testing uses the specification of a property to drive the testing process. The aim is to validate a program with respect to a target property, that is, to exercise the program and observe whether the property is violated or not. We define a test strategy for safety properties in cyclic control systems. It consists of the stepwise construction of test scenarios. Each step explores possible continuation of the dangerous scenarios found at the previous step, using heuristic search techniques. The feasibility of the strategy i s illustrated on a steam boiler case study, the target property being the “non explosion” of the boiler in presence of faults in the physical devices. As a first investigation, the strategy is instantiated with one heuristic search technique, simulated annealing, whose efficiency is analyzed in comparison with random sampling. The experimental results allow us to propose a revised version of the basic simulated annealing algorithm. Using the revised algorithm, the proposed strategy applied to the steam boiler is promising.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of Software Reliability by Sequential Testing with Simulated Annealing of Mean Field Approximation

Various problems of combinatorial optimization and permutation can be solved with neural network optimization. The problem of estimating the software reliability can be solved with the optimization of failed components to its minimum value. Various solutions of the problem of estimating the software reliability have been given. These solutions are exact and heuristic, but all the exact approach...

متن کامل

The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost

Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...

متن کامل

Sequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory

This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...

متن کامل

Increasing Embedding Probabilities of RPRPs in RIN Based BIST

In this paper, we propose a new clustered reconfigurable interconnect network (CRIN) BIST to improve the embedding probabilities of random-pattern-resistant-patterns. The proposed method uses a scan-cell reordering technique based on the signal probabilities of given test cubes and specific hardware blocks that increases the embedding probabilities of care bit clustered scan chain test cubes. W...

متن کامل

A Note on Boltzmann Tournament Selection for Genetic Algorithms and Population-Oriented Simulated Annealing

This note describes a selection procedure for genetic algorithms called Boltzmann tournament selection. As simulated annealing evolves a Boltzmann distribution in time using the Metropolis algorithm or a logistic acceptance mechanism, Boltzmann tournament selection evolves a Boltzmann distribution across a population and time using pairwise probabilistic acceptance and anti-acceptance mechanism...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002